Parallel sparse matrix multiplication for linear scaling electronic structure calculations
نویسندگان
چکیده
منابع مشابه
Parallel Sparse Matrix Multiplication for Linear Scaling Electronic Structure Calculations
Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must be run on parallel computers. We analyse the problem of parallelising the multiplication of sparse matrices with the sparsity pattern required by linear-sca...
متن کاملSparse matrix multiplications for linear scaling electronic structure calculations in an atom-centered basis set using multiatom blocks
A sparse matrix multiplication scheme with multiatom blocks is reported, a tool that can be very useful for developing linear-scaling methods with atom-centered basis functions. Compared to conventional element-by-element sparse matrix multiplication schemes, efficiency is gained by the use of the highly optimized basic linear algebra subroutines (BLAS). However, some sparsity is lost in the mu...
متن کاملPreconditioned iterative minimization for linear-scaling electronic structure calculations
Linear-scaling electronic structure methods are essential for calculations on large systems. Some of these approaches use a systematic basis set, the completeness of which may be tuned with an adjustable parameter similar to the energy cut-off of plane-wave techniques. The search for the electronic ground state in such methods suffers from an ill-conditioning which is related to the kinetic con...
متن کاملAbsolute-energy-minimum principles for linear-scaling electronic-structure calculations
Two absolute energy minimum principles are developed for first-principle linear-scaling electronic structure calculations. One is with a normalization constraint and the other without any constraint. The density matrix is represented by a set of nonorthogonal localized orbitals and an auxiliary matrix which at the minimum becomes a generalized inverse of the overlap matrix of the localized orbi...
متن کاملHighly Parallel Sparse Matrix-Matrix Multiplication
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2001
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(01)00164-3